Keccak sponge function family main document
نویسندگان
چکیده
منابع مشابه
Keccak specifications
Keccak (pronounced [kEtSak]) is a family of hash functions that are based on the sponge construction [1] and use as a building block a permutation from a set of 7 permutations. In this document, we specify these permutations, the Keccak sponge functions and the parameter values we propose for use in our SHA-3 candidates. We also give conventions for bit and byte numbering, for using the arbitra...
متن کاملConditional Cube Attack on Reduced-Round Keccak Sponge Function
Since Keccak was selected as SHA-3 hash function by NIST, it has attracted considerable attention from cryptographic researchers. Keccak sponge function [1] has also been used to design message authentication codes (MAC) and authenticated encryption (AE) scheme Keyak. Till now, the most efficient key recovery attacks on Keccak-MAC and Keyak are cube attacks and cube-attack-like cryptanalysis pr...
متن کاملPractical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function
In this paper we mount the cube attack on the Keccak sponge function. The cube attack, formally introduced in 2008, is an algebraic technique applicable to cryptographic primitives whose output can be described as a low-degree polynomial in the input. Our results show that 5and 6-round Keccak sponge function is vulnerable to this technique. All the presented attacks have practical complexities ...
متن کاملAn FPGA implementation of SHA 3 using keccak function for 512 bit encryption
SHA-3 (Secure hash algorithm-3), originally known as Keccak is a cryptographic hash function selected as the winner of the NIST hash function competition. Hash functions have many applications in cryptography mainly in digital signatures and message authentication codes and in network security. Implementation of the main building block (compression function) for five different SHA-3 candidates ...
متن کاملA Lightweight Implementation of Keccak Hash Function for Radio-Frequency Identification Applications
In this paper, we present a lightweight implementation of the permutation Keccak-f[200] and Keccak-f[400] of the SHA-3 candidate hash function Keccak. Our design is well suited for radio-frequency identification (RFID) applications that have limited resources and demand lightweight cryptographic hardware. Besides its low-area and low-power, our design gives a decent throughput. To the best of o...
متن کامل